Algoritma Masih Musliatun (Mm) untuk Mendukung Sistem Otomatisasi Pendaftaran Praktikum dengan Pengujian pada Jaringan Komputer (Studi Kasus di Stta YOGYAKARTA)

Practicum registration systems that exist on campus STTA previously done manually, where students will sign up to the admin to bring proof of payment practicum. Students are free to choose his own class, this often resulted in unbalanced number of students in the classroom lab that is consideredless effective way. This makes the emergence of the idea to establish an MM algorithm is applied to a practical application o f automation systems. MM algorithm works by determining many lab classes based on students who took the KRS. Furthermore, students who have paid practicum will be immediately incorporated into the classes that are available with regard to the number of students and GPA o f students per class, so it will obtain practical classes by the number o f students and the average GPA o f each class balanced.Concept application using client-server database, where the database is on the Local Area Network (LAN) STTA. To facilitate the management admin, then the application will be tested on the LAN network and VPN (Virtual Private Network) network. LAN is a computers network that are connected to a computer server by using specific topologies, typically used in areas of the building or area a distance o f not more than 1 km (local area). While VPN is a secure way to access the Local Area Network that is in range, using the Internet or other public network to perform packet data transmission in private. By using a VPN, users can access the computer that is on the LAN even though the user is not in the same location with a LAN

Penerapan Sistem Keamanan Menggunakan Cryptography Pada Aplikasi Chatting Dengan Memodifikasi Algoritma Rivest Shamir Adleman (Rsa)

Chatting application is an application which used for communication through local network or internet. It can use to make communication to be effective and easy to use but there are several shortage in delivery information process is data security when communication is going on. Using chrypthography with modification Rivest Shamir adleman (RSA) algorithm in encryption process and decryption on packet data which transmited is one of security system which can used in this application then the security of data packet secured. Result from implementation of chatting application which apply chrypthography with modification Rivest Shamir adleman (RSA) algorithm have done in local network and internet able to run smoothly and have done by several testing cases based on certain scenario. Whereas process testing encryption and decryption using tools wireshark

Optimal Protocol for Contrast-enhanced Free-running 5D Whole-heart Coronary MR Angiography at 3T.

Free-running 5D whole-heart coronary MR angiography (MRA) is gaining in popularity because it reduces scanning complexity by removing the need for specific slice orientations, respiratory gating, or cardiac triggering. At 3T, a gradient echo (GRE) sequence is preferred in combination with contrast injection. However, neither the injection scheme of the gadolinium (Gd) contrast medium, the choice of the RF excitation angle, nor the dedicated image reconstruction parameters have been established for 3T GRE free-running 5D whole-heart coronary MRA. In this study, a Gd injection scheme, RF excitation angles of lipid-insensitive binominal off-resonance RF excitation (LIBRE) pulse for valid fat suppression and continuous data acquisition, and compressed-sensing reconstruction regularization parameters were optimized for contrast-enhanced free-running 5D whole-heart coronary MRA using a GRE sequence at 3T. Using this optimized protocol, contrast-enhanced free-running 5D whole-heart coronary MRA using a GRE sequence is feasible with good image quality at 3T

Bounded Rational Decision-Making with Adaptive Neural Network Priors

Bounded rationality investigates utility-optimizing decision-makers with limited information-processing power. In particular, information theoretic bounded rationality models formalize resource constraints abstractly in terms of relative Shannon information, namely the Kullback-Leibler Divergence between the agents' prior and posterior policy. Between prior and posterior lies an anytime deliberation process that can be instantiated by sample-based evaluations of the utility function through Markov Chain Monte Carlo (MCMC) optimization. The most simple model assumes a fixed prior and can relate abstract information-theoretic processing costs to the number of sample evaluations. However, more advanced models would also address the question of learning, that is how the prior is adapted over time such that generated prior proposals become more efficient. In this work we investigate generative neural networks as priors that are optimized concurrently with anytime sample-based decision-making processes such as MCMC. We evaluate this approach on toy examples.Comment: Published in ANNPR 2018: Artificial Neural Networks in Pattern Recognitio

Somatosensory Comparison during Haptic Tracing

Active sensing involves memory retrieval and updating as well as mechanisms that trigger corrections to the ongoing exploratory movement. The present study examined this process in a task where human subjects moved the index fingertip clockwise around the circumference of a virtual sphere created by a robotic device. The fingertip pressed into the sphere during the movement, and the subjects were to report slight differences in sphere size (or surface curvature), which occurred from trial to trial. During each 2- to 3-s trial, subjects gradually adjusted their speed and pressure according to the current surface curvature, achieving a consistent level of contact force in the last half of the exploration. The results demonstrate that subjects were gradually accumulating haptic information about curvature and, at the same time, gradually changing the motor commands for the movement. When subjects encountered an unexpected transition in curvature (from circular to flat), they reacted by abruptly decreasing contact force at a latency of about 50 ms. This short latency indicates that spinally mediated corrections are engaged during this task. The results support the hypothesis that during haptic exploration, the neural comparison between expected and actual somatosensory feedback takes places at multiple levels, including the spinal cord

Candidate Brown-dwarf Microlensing Events with Very Short Timescales and Small Angular Einstein Radii

Short-timescale microlensing events are likely to be produced by substellar brown dwarfs (BDs), but it is difficult to securely identify BD lenses based on only event timescales t_E because short-timescale events can also be produced by stellar lenses with high relative lens-source proper motions. In this paper, we report three strong candidate BD-lens events found from the search for lensing events not only with short timescales (t_E ≲ 6 days) but also with very small angular Einstein radii (θ_E ≲ 0.05 mas) among the events that have been found in the 2016–2019 observing seasons. These events include MOA-2017-BLG-147, MOA-2017-BLG-241, and MOA-2019-BLG-256, in which the first two events are produced by single lenses and the last event is produced by a binary lens. From the Monte Carlo simulations of Galactic events conducted with the combined t_E and θ_E constraint, it is estimated that the lens masses of the individual events are 0.051^(+0.100)_(−0.027) M⊙, 0.044^(+0.090)_(−0.023) M⊙, and 0.046^(+0.067)_(−0.023) M⊙/0.038^(+0.056)_(−0.019) M⊙ and the probability of the lens mass smaller than the lower limit of stars is ~80% for all events. We point out that routine lens mass measurements of short-timescale lensing events require survey-mode space-based observations

Measuring Generalization of Visuomotor Perturbations in Wrist Movements Using Mobile Phones

Recent studies in motor control have shown that visuomotor rotations for reaching have narrow generalization functions: what we learn during movements in one direction only affects subsequent movements into close directions. Here we wanted to measure the generalization functions for wrist movement. To do so we had 7 subjects performing an experiment holding a mobile phone in their dominant hand. The mobile phone's built in acceleration sensor provided a convenient way to measure wrist movements and to run the behavioral protocol. Subjects moved a cursor on the screen by tilting the phone. Movements on the screen toward the training target were rotated and we then measured how learning of the rotation in the training direction affected subsequent movements in other directions. We find that generalization is local and similar to generalization patterns of visuomotor rotation for reaching